Introduction to the "Industrial Benchmark"
نویسندگان
چکیده
A novel reinforcement learning benchmark, called Industrial Benchmark, is introduced. The Industrial Benchmark aims at being be realistic in the sense, that it includes a variety of aspects that we found to be vital in industrial applications. It is not designed to be an approximation of any real system, but to pose the same hardness and complexity.
منابع مشابه
Benchmark Forecasting in Data Envelopment Analysis for Decision Making Units
Although DEA is a powerful method in evaluating DMUs, it does have some limitations. One of the limitations of this method is the result of the evaluation is based on previously data and the results are not proper for forecasting the future changes. So For this purpose, we design feedback loops for forecasting inputs and outputs through system dynamics and simulation. Then we use DEA model to f...
متن کاملA novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملCoordination of promotional effort, corporate social responsibility and periodic review replenishment decisions in a two-echelon socially responsible supply chain
In this paper, we explore the issue of coordination in a manufacturer-retailer supply chain where the manufacturer is socially responsible and invests in CSR activities. On the other hand, the retailer invests in promotional efforts and uses a periodic review order-up-to policy for replenishing items. First, the decentralized decision-making structure is modeled to calculate the minimum accepta...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.03793 شماره
صفحات -
تاریخ انتشار 2016